Single-Peaked Consistency for Weak Orders Is Easy
نویسنده
چکیده
In economics and social choice single-peakedness is one of the most important and commonly studied models for preferences. It is well known that single-peaked consistency for total orders is in P. However in practice a preference profile is not always comprised of total orders. Often voters have indifference between some of the candidates. In a weak preference order indifference must be transitive. We show that single-peaked consistency for weak orders is in P for three different variants of single-peakedness for weak orders. Specifically, we consider Black’s original definition of single-peakedness for weak orders, Black’s definition of single-plateaued preferences, and the existential model recently introduced by Lackner. We accomplish our results by transforming each of these single-peaked consistency problems to the problem of determining if a 0-1 matrix has the consecutive ones property.
منابع مشابه
The Single-Peaked Domain Revisited: A Simple Global Characterization
It is proved that, among all restricted preference domains that guarantee consistency (i.e. transitivity) of pairwise majority voting, the single-peaked domain is the only minimally rich and connected domain that contains two completely reversed strict preference orders. It is argued that this result explains the predominant role of single-peakedness as a domain restriction in models of politic...
متن کاملSingle-peaked consistency and its complexity
A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known such restriction is singlepeakedness. In this paper we focus on the problem of determining whether a given profile is single-peaked with respect to some axis, and on the computation of such an axis. This problem has already been considered in [2]...
متن کاملA Practical Comparison of Cluster Operating Systems
Shared Memory is an interesting communication paradigm for SMP machines and clusters. Weak consistency models have been proposed to improve efficiency of shared memory applications. In a programming environment offering weak consistency it is a necessity to worry about individual load and store operations and about proper synchronization. In contrast to this explicit style of distributed progra...
متن کاملSingle-peaked preferences over multidimensional binary alternatives
Single-peaked preferences are important throughout social choice theory. In this article,we consider single-peaked preferences over multidimensional binary alternative spaces—that is, alternative spaces of the form {0, 1}n for some integer n ≥ 2. We show that preferences that are single-peaked with respect to a normalized separable base order are nonseparable except in the most trivial cases. W...
متن کاملModeling Single-Peakedness for Votes with Ties
Single-peakedness is one of the most important and well-known domain restrictions on preferences. The computational study of single-peaked electorates has largely been restricted to elections with tie-free votes, and recent work that studies the computational complexity of manipulative attacks for single-peaked elections for votes with ties has been restricted to nonstandard models of single-pe...
متن کامل